Behavioural Equivalences on Finite-State Systems are PTIME-hard
نویسندگان
چکیده
The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e., language inclusion) is ptime-hard, even for finite acyclic labelled transition systems. This reproves and substantially extends the result of Balcázar, Gabarró and Sántha (1992) for bisimilarity.
منابع مشابه
Computational Complexity of Some Equivalence-Checking Problems
This habilitation thesis gives an overview of five papers of the author in the area of verification, in particular, in the study of computational complexity of equivalence checking problems and related areas. The first of these papers, Sawa, Jančar: Equivalences on Finite-State Systems are PTIME-hard (2005), shows that deciding any relation between bisimulation equivalence (bisimilarity) and tr...
متن کاملChecking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract)
Consider two synchronously communicating systems p and q over finite agents. Assume that one wants to check whether p ,~ q for one of the commonly used equivalences. We show that this question is PSPACE hard for all equivalences which lie between strong bisimulation and trace equivalences. For some equivalences exponential lower and upper bounds are proven. We also show that this problem is NP ...
متن کاملBehavioural Equivalence for Infinite Systems - Partially Decidable!
For finite-state systems non-interleaving equivalences are computation-ally at least as hard as interleaving equivalences. In this paper we showthat when moving to infinite-state systems, this situation may changedramatically.We compare standard language equivalence for process description lan-guages with two generalizations based on traditional approaches captur-ing...
متن کاملOn Finite Representations of Infinite-State Behaviours
We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularity becomes insufficient in case of all equivalences of van Glabbeek’s hierarchy except bisimilarity, and we design and justify a generalization in the form of strong regularity and finite characterizations. We show that the cond...
متن کاملOn the Complexity of Deciding Behavioural Equivalences and Preorders A Survey
This paper gives an overview of the computational complexity of all the equivalences in the linear/branching time hierarchy [vG90a] and the preorders in the corresponding hierarchy of preorders. We consider finite state or regular processes as well as infinite-state BPA [BK84b] processes. A distinction, which turns out to be important in the finite-state processes, is that of simulation-like eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers and Artificial Intelligence
دوره 24 شماره
صفحات -
تاریخ انتشار 2005